Computing with the Finite Fourier Transform Is
نویسنده
چکیده
منابع مشابه
Free and Forced Transverse Vibration Analysis of Moderately Thick Orthotropic Plates Using Spectral Finite Element Method
In the present study, a spectral finite element method is developed for free and forced transverse vibration of Levy-type moderately thick rectangular orthotropic plates based on first-order shear deformation theory. Levy solution assumption was used to convert the two-dimensional problem into a one-dimensional problem. In the first step, the governing out-of-plane differential equations are tr...
متن کاملFast Fourier Transforms for Finite Inverse Semigroups
We extend the theory of fast Fourier transforms on finite groups to finite inverse semigroups. We use a general method for constructing the irreducible representations of a finite inverse semigroup to reduce the problem of computing its Fourier transform to the problems of computing Fourier transforms on its maximal subgroups and a fast zeta transform on its poset structure. We then exhibit exp...
متن کاملThe Cooley–Tukey FFT and Group Theory
In 1965 J. Cooley and J. Tukey published an article detailing an efficient algorithm to compute the Discrete Fourier Transform, necessary for processing the newly available reams of digital time series produced by recently invented analog-to-digital converters. Since then, the Cooley– Tukey Fast Fourier Transform and its variants has been a staple of digital signal processing. Among the many ca...
متن کاملSpectrally formulated finite element for vibration analysis of an Euler-Bernoulli beam on Pasternak foundation
In this article, vibration analysis of an Euler-Bernoulli beam resting on a Pasternak-type foundation is studied. The governing equation is solved by using a spectral finite element model (SFEM). The solution involves calculating wave and time responses of the beam. The Fast Fourier Transform function is used for temporal discretization of the governing partial differential equation into a se...
متن کاملComputational Complexity of Fourier Transforms Over Finite Fields*
In this paper we describe a method for computing the Discrete Fourier Transform (DFT) of a sequence of n elements over a finite field GF(pm) with a number of bit operations 0(nm log(nm) ■ P(q)) where P(q) is the number of bit operations required to multiply two q-bit integers and q = 2 log2« + 4 log2m + 4 log2p. This method is uniformly applicable to all instances and its order of complexity is...
متن کاملA New Implicit Finite Difference Method for Solving Time Fractional Diffusion Equation
In this paper, a time fractional diffusion equation on a finite domain is con- sidered. The time fractional diffusion equation is obtained from the standard diffusion equation by replacing the first order time derivative by a fractional derivative of order 0 < a< 1 (in the Riemann-Liovill or Caputo sence). In equation that we consider the time fractional derivative is in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007